Knocking out Pk-free graphs
نویسندگان
چکیده
منابع مشابه
Knocking Out P k -free Graphs
A parallel knock-out scheme for a graph proceeds in rounds in each of which each surviving vertex eliminates one of its surviving neighbours. A graph is KO-reducible if there exists such a scheme that eliminates every vertex in the graph. The Parallel Knock-Out problem is to decide whether a graph G is KO-reducible. This problem is known to be NP-complete and has been studied for several graph ...
متن کاملKnocking out the Argonautes
Argonaute proteins are key players in gene silencing involving small RNAs. In this issue, Yigit et al. (2006) report a comprehensive study of Argonautes in the worm that places many of the 27 family members into a complex gene-silencing network.
متن کامل“Knocking out” a Neural Circuit
Although the visual system occupies nearly half of the mammalian brain, we still do not completely understand its first synaptic stage. One reason is that the dendrites postsynaptic to photoreceptors comprise such a maze of fine processes that doubt remains whether all the second order circuits have been identified—even after 4 decades of electron microscopy. Now advanced functional methods app...
متن کاملKainate receptors: knocking out plasticity.
There is increasing evidence that kainate receptors contribute to both postsynaptic and presynaptic signaling. Studies of knockout mice have played a pivotal role in defining the functions of kainate receptors, including a recent study that implicates kainate receptors in frequency-dependent facilitation and long-term potentiation of hippocampal mossy fiber synapses.
متن کاملThree Complexity Results on Coloring Pk-Free Graphs
We prove three complexity results on vertex coloring problems restricted to Pk-free graphs, i.e., graphs that do not contain a path on k vertices as an induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring remains NP-complete when restricted to P6-free graphs. Recent results of Hoàng et al. imply that this problem is polynomially solvable on P5-free graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.04.010